A Pregroup Grammar for Chord Sequences

نویسنده

  • Richard G. TERRAT
چکیده

In 1984, Mark STEEDMAN [7] proposed a generative grammar based on six context sensitive rewriting rules able to produce a large variety of blues chord sequences. Later, François PACHET [6] developed a method for analyzing jazz chord sequences. Then, Marc CHEMILLER [4] [5] uses STEEDMAN’s grammar to compose by computers jazz music based upon chord sequences generated by this grammar. About twenty years after his first work, STEEDMAN [8] [9] comes back to chord sequences analysis, but now with the aim of recognition based upon categorial grammars. Meanwhile, pregroup grammars have been conceived as an algebraic tool to recognize well-formed sentences in natural languages [1] [2]. Here we wish to use pregroup grammars to recognize well-formed sequences of chords, especially in Jazz music. Our recognition process reduces the chord sequence to a simpler one. If this later sequence is similar to a well-known pattern like blues, rag, “anatole” or other, we can classify the original sequence as conform to this pattern.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pregroup Grammars for Chords

Pregroups had been conceived as an algebraic tool to recognize grammatically well-formed sentences in natural languages [3]. Here we wish to use pregroups to recognize well-formed chords of pitches, for a given definition of those chords. We show how a judicious choice of basic and simple types allows a context-free grammatical description. Then we use the robustness property to extend the set ...

متن کامل

Fully Lexicalized Pregroup Grammars

Pregroup grammars are a context-free grammar formalism introduced as a simplification of Lambek calculus. This formalism is interesting for several reasons: the syntactical properties of words are specified by a set of types like the other type-based grammar formalisms ; as a logical model, compositionality is easy ; a polytime parsing algorithm exists. However, this formalism is not completely...

متن کامل

PPQ : a pregroup parser using majority composition

Pregroup grammars are a mathematical formalism in the spirit of categorial grammars. They are close to logical formalism like Lambek calculus but have a polynomial parsing algorithm. The paper presents a parser based on pregroup grammar that uses a tabular approach based on majority partial composition.

متن کامل

A Pregroup Analysis of Japanese Causatives

We explore a computational algebraic approach to grammar via pregroups. We examine how the structures of Japanese causatives can be treated in the framework of a pregroup grammar. In our grammar, the dictionary assigns one or more syntactic types to each word and the grammar rules are used to infer types to strings of words. We developed a practical parser representing our pregroup grammar, whi...

متن کامل

Pregroup Grammars and Context-free Grammars

Pregroup grammars were introduced by Lambek [20] as a new formalism of type-logical grammars. They are weakly equivalent to context-free grammars [8]. The proof in one direction uses the fact that context-free languages are closed under homomorphism and inverse homomorphism. Here we present a direct construction of a context-free grammar and a push-down automaton, equivalent to a given pregroup...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009